Solving Arc Routing Problems Using the Lin-Kernighan-Helsgaun Algorithm

نویسنده

  • Keld Helsgaun
چکیده

It is well known that many arc routing problems can be transformed into the Equality Generalized Traveling Salesman Problem (E-GTSP), which in turn can be transformed into a standard Asymmetric Traveling Salesman Problem (TSP). This opens up the possibility of solving arc routing problems using existing solvers for TSP. This paper evaluates the performance of the state-of-the art TSP solver Lin-Kernighan-Helsgaun (LKH) on a broad class of transformed arc routing instances. It is shown that LKH makes it possible to find solutions of good quality to large-scale undirected, mixed, and windy postman and general routing problem instances.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the Clustered Traveling Salesman Problem Using the Lin-Kernighan-Helsgaun Algorithm

The Clustered Traveling Salesman Problem (CTSP) is an extension of the Traveling Salesman Problem (TSP) where the set of cities is partitioned into clusters, and the salesman has to visit the cities of each cluster consecutively. It is well known that any instance of CTSP can be transformed into a standard instance of the Traveling Salesman Problem (TSP), and therefore solved with a TSP solver....

متن کامل

Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun Algorithm

The Equality Generalized Traveling Salesman Problem (E-GTSP) is an extension of the Traveling Salesman Problem (TSP) where the set of cities is partitioned into clusters, and the salesman has to visit every cluster exactly once. It is well known that any instance of E-GTSP can be transformed into a standard asymmetric instance of the Traveling Salesman Problem (TSP), and therefore solved with a...

متن کامل

A Multilevel Lin-Kernighan-Helsgaun Algorithm for the Travelling Salesman Problem

The multilevel paradigm has recently been applied to the travelling salesman problem with considerable success. The resulting algorithm progressively coarsens the problem, initialises a tour and then employs a local search algorithm to refine the solution on each of the coarsened problems in reverse order. In the original version the chained Lin-Kernighan (CLK) scheme was used for the refinemen...

متن کامل

An effective implementation of the Lin-Kernighan traveling salesman heuristic

This report describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal or nearoptimal solutions for the symmetric traveling salesman problem. Computational tests show that the implementation is highly effective. It has found optimal solutions for all solved problem instances we have been able to obtain, including a 7397-city problem (th...

متن کامل

A Parallel Approach for Solving a Large-Scale Traveling Salesman Problem

A parallel approach for solving a large-scale Euclidean Traveling Salesman Problem (TSP) is presented. The approach consists of the following stages: partitioning the input data set into clusters, solving the TSP for each cluster to get partial solutions, merging the partial solutions to form a complete solution, and optimizing the complete solution. Lin-Kernighan-Helsgaun (LKH) algorithm is us...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014